Efficient Heuristics for Structure Learning of k-Dependence Bayesian Classifier
نویسندگان
چکیده
منابع مشابه
K-Dependence Bayesian Classifier Ensemble
To maximize the benefit that can be derived from the information implicit in big data, ensemble methods generate multiple models with sufficient diversity through randomization or perturbation. A k-dependence Bayesian classifier (KDB) is a highly scalable learning algorithm with excellent time and space complexity, along with high expressivity. This paper introduces a new ensemble approach of K...
متن کاملEfficient Heuristics for Discriminative Structure Learning of Bayesian Network Classifiers
We introduce a simple order-based greedy heuristic for learning discriminative structure within generative Bayesian network classifiers. We propose two methods for establishing an order of N features. They are based on the conditional mutual information and classification rate (i.e., risk), respectively. Given an ordering, we can find a discriminative structure with O ( Nk+1 ) score evaluations...
متن کاملLearning a Flexible K-Dependence Bayesian Classifier from the Chain Rule of Joint Probability Distribution
As one of the most common types of graphical models, the Bayesian classifier has become an extremely popular approach to dealing with uncertainty and complexity. The scoring functions once proposed and widely used for a Bayesian network are not appropriate for a Bayesian classifier, in which class variable C is considered as a distinguished one. In this paper, we aim to clarify the working mech...
متن کاملBetter Initialization Heuristics for Order-based Bayesian Network Structure Learning
An effective approach for learning Bayesian network structures is to perform a local search on the space of topological orderings, followed by a systematic search of compatible parent sets. Typically, the local search is initialized with an ordering generated uniformly at random. This can lead to poor local optima, slow down convergence and hurt the performance of the method. In this work we de...
متن کاملEfficient Structure Learning of Bayesian Networks using Constraints
This paper addresses the problem of learning Bayesian network structures from data based on score functions that are decomposable. It describes properties that strongly reduce the time and memory costs of many known methods without losing global optimality guarantees. These properties are derived for different score criteria such as Minimum Description Length (or Bayesian Information Criterion)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2018
ISSN: 1099-4300
DOI: 10.3390/e20120897